window = global;
function vmProxy(object){
    return new Proxy(object,{
            get: function(target, property, receiver){
                if(typeof(target[property]) != 'function'){
                    if(property=='cookie'){
                        debugger;
                    }
                    console.log("get:",target,'------', property,'------', target[property]);
                };
                return target[property];
            },
            set: function(target, property, value) {
                console.log("set: " ,target, property, value) ;
                return Reflect.set(...arguments);
            },
    });
};

window = vmProxy(window);
window._cf_chl_opt = {
    cFPWv: 'b'
};
~function(R, g, h, m, n, w) {
    R = b,
    function(c, e, Q, f, y) {
        for (Q = b,
        f = c(); !![]; )
            try {
                if (y = parseInt(Q(320)) / 1 * (parseInt(Q(254)) / 2) + -parseInt(Q(256)) / 3 * (-parseInt(Q(258)) / 4) + -parseInt(Q(291)) / 5 * (-parseInt(Q(268)) / 6) + parseInt(Q(260)) / 7 * (-parseInt(Q(304)) / 8) + -parseInt(Q(255)) / 9 * (parseInt(Q(326)) / 10) + -parseInt(Q(262)) / 11 * (-parseInt(Q(286)) / 12) + -parseInt(Q(277)) / 13,
                e === y)
                    break;
                else
                    f.push(f.shift())
            } catch (z) {
                f.push(f.shift())
            }
    }(a, 646431),
    g = this || self,
    h = g[R(309)],
    m = {},
    m[R(302)] = 'o',
    m[R(349)] = 's',
    m[R(319)] = 'u',
    m[R(338)] = 'z',
    m[R(325)] = 'n',
    m[R(252)] = 'I',
    m[R(330)] = 'b',
    n = m,
    g[R(265)] = function(f, y, z, A, a0, C, D, E, F, G, H) {
        if (a0 = R,
        null === y || y === void 0)
            return A;
        for (C = u(y),
        f[a0(279)][a0(318)] && (C = C[a0(281)](f[a0(279)][a0(318)](y))),
        C = f[a0(263)][a0(313)] && f[a0(259)] ? f[a0(263)][a0(313)](new f[(a0(259))](C)) : function(I, a1, J) {
            for (a1 = a0,
            I[a1(305)](),
            J = 0; J < I[a1(303)]; I[J + 1] === I[J] ? I[a1(352)](J + 1, 1) : J += 1)
                ;
            return I
        }(C),
        D = 'nAsAaAb'.split('A'),
        D = D[a0(272)][a0(321)](D),
        E = 0; E < C[a0(303)]; F = C[E],
        G = s(f, y, F),
        D(G) ? (H = G === 's' && !f[a0(283)](y[F]),
        a0(307) === z + F ? B(z + F, G) : H || B(z + F, y[F])) : B(z + F, G),
        E++)
            ;
        return A;
        function B(I, J, Z) {
            Z = b,
            Object[Z(311)][Z(276)][Z(339)](A, J) || (A[J] = []),
            A[J][Z(278)](I)
        }
    }
    ,
    w = function(a3, e, f, y) {
        return a3 = R,
        e = String[a3(296)],
        f = {
            'h': function(z) {
                return null == z ? '' : f.g(z, 6, function(A, a4) {
                    return a4 = b,
                    a4(334)[a4(345)](A)
                })
            },
            'g': function(z, A, B, a5, C, D, E, F, G, H, I, J, K, L, M, N, O, P) {
                if (a5 = a3,
                z == null)
                    return '';
                for (D = {},
                E = {},
                F = '',
                G = 2,
                H = 3,
                I = 2,
                J = [],
                K = 0,
                L = 0,
                M = 0; M < z[a5(303)]; M += 1)
                    if (N = z[a5(345)](M),
                    Object[a5(311)][a5(276)][a5(339)](D, N) || (D[N] = H++,
                    E[N] = !0),
                    O = F + N,
                    Object[a5(311)][a5(276)][a5(339)](D, O))
                        F = O;
                    else {
                        if (Object[a5(311)][a5(276)][a5(339)](E, F)) {
                            if (256 > F[a5(295)](0)) {
                                for (C = 0; C < I; K <<= 1,
                                A - 1 == L ? (L = 0,
                                J[a5(278)](B(K)),
                                K = 0) : L++,
                                C++)
                                    ;
                                for (P = F[a5(295)](0),
                                C = 0; 8 > C; K = 1.03 & P | K << 1,
                                L == A - 1 ? (L = 0,
                                J[a5(278)](B(K)),
                                K = 0) : L++,
                                P >>= 1,
                                C++)
                                    ;
                            } else {
                                for (P = 1,
                                C = 0; C < I; K = P | K << 1.43,
                                L == A - 1 ? (L = 0,
                                J[a5(278)](B(K)),
                                K = 0) : L++,
                                P = 0,
                                C++)
                                    ;
                                for (P = F[a5(295)](0),
                                C = 0; 16 > C; K = 1.6 & P | K << 1.44,
                                L == A - 1 ? (L = 0,
                                J[a5(278)](B(K)),
                                K = 0) : L++,
                                P >>= 1,
                                C++)
                                    ;
                            }
                            G--,
                            0 == G && (G = Math[a5(301)](2, I),
                            I++),
                            delete E[F]
                        } else
                            for (P = D[F],
                            C = 0; C < I; K = K << 1 | P & 1,
                            A - 1 == L ? (L = 0,
                            J[a5(278)](B(K)),
                            K = 0) : L++,
                            P >>= 1,
                            C++)
                                ;
                        F = (G--,
                        0 == G && (G = Math[a5(301)](2, I),
                        I++),
                        D[O] = H++,
                        String(N))
                    }
                if ('' !== F) {
                    if (Object[a5(311)][a5(276)][a5(339)](E, F)) {
                        if (256 > F[a5(295)](0)) {
                            for (C = 0; C < I; K <<= 1,
                            A - 1 == L ? (L = 0,
                            J[a5(278)](B(K)),
                            K = 0) : L++,
                            C++)
                                ;
                            for (P = F[a5(295)](0),
                            C = 0; 8 > C; K = 1.15 & P | K << 1,
                            A - 1 == L ? (L = 0,
                            J[a5(278)](B(K)),
                            K = 0) : L++,
                            P >>= 1,
                            C++)
                                ;
                        } else {
                            for (P = 1,
                            C = 0; C < I; K = K << 1 | P,
                            L == A - 1 ? (L = 0,
                            J[a5(278)](B(K)),
                            K = 0) : L++,
                            P = 0,
                            C++)
                                ;
                            for (P = F[a5(295)](0),
                            C = 0; 16 > C; K = K << 1.76 | P & 1,
                            L == A - 1 ? (L = 0,
                            J[a5(278)](B(K)),
                            K = 0) : L++,
                            P >>= 1,
                            C++)
                                ;
                        }
                        G--,
                        G == 0 && (G = Math[a5(301)](2, I),
                        I++),
                        delete E[F]
                    } else
                        for (P = D[F],
                        C = 0; C < I; K = 1 & P | K << 1.12,
                        L == A - 1 ? (L = 0,
                        J[a5(278)](B(K)),
                        K = 0) : L++,
                        P >>= 1,
                        C++)
                            ;
                    G--,
                    G == 0 && I++
                }
                for (P = 2,
                C = 0; C < I; K = P & 1 | K << 1,
                A - 1 == L ? (L = 0,
                J[a5(278)](B(K)),
                K = 0) : L++,
                P >>= 1,
                C++)
                    ;
                for (; ; )
                    if (K <<= 1,
                    A - 1 == L) {
                        J[a5(278)](B(K));
                        break
                    } else
                        L++;
                return J[a5(317)]('')
            },
            'j': function(z, a6) {
                return a6 = a3,
                null == z ? '' : z == '' ? null : f.i(z[a6(303)], 32768, function(A, a7) {
                    return a7 = a6,
                    z[a7(295)](A)
                })
            },
            'i': function(z, A, B, a8, C, D, E, F, G, H, I, J, K, L, M, N, P, O) {
                for (a8 = a3,
                C = [],
                D = 4,
                E = 4,
                F = 3,
                G = [],
                J = B(0),
                K = A,
                L = 1,
                H = 0; 3 > H; C[H] = H,
                H += 1)
                    ;
                for (M = 0,
                N = Math[a8(301)](2, 2),
                I = 1; N != I; O = J & K,
                K >>= 1,
                0 == K && (K = A,
                J = B(L++)),
                M |= I * (0 < O ? 1 : 0),
                I <<= 1)
                    ;
                switch (M) {
                case 0:
                    for (M = 0,
                    N = Math[a8(301)](2, 8),
                    I = 1; I != N; O = J & K,
                    K >>= 1,
                    0 == K && (K = A,
                    J = B(L++)),
                    M |= I * (0 < O ? 1 : 0),
                    I <<= 1)
                        ;
                    P = e(M);
                    break;
                case 1:
                    for (M = 0,
                    N = Math[a8(301)](2, 16),
                    I = 1; N != I; O = J & K,
                    K >>= 1,
                    K == 0 && (K = A,
                    J = B(L++)),
                    M |= I * (0 < O ? 1 : 0),
                    I <<= 1)
                        ;
                    P = e(M);
                    break;
                case 2:
                    return ''
                }
                for (H = C[3] = P,
                G[a8(278)](P); ; ) {
                    if (L > z)
                        return '';
                    for (M = 0,
                    N = Math[a8(301)](2, F),
                    I = 1; I != N; O = K & J,
                    K >>= 1,
                    0 == K && (K = A,
                    J = B(L++)),
                    M |= (0 < O ? 1 : 0) * I,
                    I <<= 1)
                        ;
                    switch (P = M) {
                    case 0:
                        for (M = 0,
                        N = Math[a8(301)](2, 8),
                        I = 1; I != N; O = J & K,
                        K >>= 1,
                        K == 0 && (K = A,
                        J = B(L++)),
                        M |= I * (0 < O ? 1 : 0),
                        I <<= 1)
                            ;
                        C[E++] = e(M),
                        P = E - 1,
                        D--;
                        break;
                    case 1:
                        for (M = 0,
                        N = Math[a8(301)](2, 16),
                        I = 1; I != N; O = K & J,
                        K >>= 1,
                        K == 0 && (K = A,
                        J = B(L++)),
                        M |= (0 < O ? 1 : 0) * I,
                        I <<= 1)
                            ;
                        C[E++] = e(M),
                        P = E - 1,
                        D--;
                        break;
                    case 2:
                        return G[a8(317)]('')
                    }
                    if (D == 0 && (D = Math[a8(301)](2, F),
                    F++),
                    C[P])
                        P = C[P];
                    else if (P === E)
                        P = H + H[a8(345)](0);
                    else
                        return null;
                    G[a8(278)](P),
                    C[E++] = H + P[a8(345)](0),
                    D--,
                    H = P,
                    0 == D && (D = Math[a8(301)](2, F),
                    F++)
                }
            }
        },
        y = {},
        y[a3(289)] = f.h,
        y
    }(),
    x();
    function v(a2, y, z, A, B, C) {
        a2 = R;
        try {
            return y = h[a2(310)](a2(267)),
            y[a2(308)] = a2(344),
            y[a2(270)] = '-1',
            h[a2(316)][a2(323)](y),
            z = y[a2(324)],
            A = {},
            A = OmLPrNfmlt(z, z, '', A),
            A = OmLPrNfmlt(z, z[a2(282)] || z[a2(343)], 'n.', A),
            A = OmLPrNfmlt(z, y[a2(271)], 'd.', A),
            h[a2(316)][a2(337)](y),
            B = {},
            B.r = A,
            B.e = null,
            B
        } catch (D) {
            return C = {},
            C.r = {},
            C.e = D,
            C
        }
    }
    function o(c, e, W) {
        return W = R,
        e instanceof c[W(327)] && 0 < c[W(327)][W(311)][W(292)][W(339)](e)[W(322)](W(335))
    }
    function u(c, Y, e) {
        for (Y = R,
        e = []; c !== null; e = e[Y(281)](Object[Y(341)](c)),
        c = Object[Y(253)](c))
            ;
        return e
    }
    function j(T, c, e, f, y) {
        if ((T = R,
        c = g[T(297)],
        e = 3600,
        c.t) && (f = Math[T(264)](+atob(c.t)),
        y = Math[T(264)](Date[T(261)]() / 1e3),
        y - f > e))
            return ![];
        return !![]
    }
    function i(c, S) {
        return S = R,
        Math[S(284)]() < c
    }
    function b(c, d, e) {
        return e = a(),
        b = function(f, g, h) {
            return f = f - 250,
            h = e[f],
            h
        }
        ,
        b(c, d)
    }
    function x(a9, c, e, f, y) {
        if (a9 = R,
        c = g[a9(297)],
        !c)
            return;
        if (!j())
            return;
        (e = ![],
        f = function(aa, z) {
            (aa = a9,
            !e) && (e = !![],
            z = v(),
            k(c.r, z.r),
            z.e && l(aa(350), z.e, aa(346)))
        }
        ,
        h[a9(312)] !== a9(266)) ? f() : g[a9(250)] ? h[a9(250)](a9(328), f) : (y = h[a9(273)] || function() {}
        ,
        h[a9(273)] = function(ab) {
            ab = a9,
            y(),
            h[ab(312)] !== ab(266) && (h[ab(273)] = y,
            f())
        }
        )
    }
    function a(ac) {
        return ac = 'Array;floor;OmLPrNfmlt;loading;iframe;6084132xQymhN;open;tabIndex;contentDocument;includes;onreadystatechange;isArray;timeout;hasOwnProperty;21117850BaDzsx;push;Object;/invisible/jsd;concat;clientInformation;isNaN;random;Content-type;157380bpqeiF;XMLHttpRequest;catch;EDPpuUck; - ;5YLAaZs;toString;_cf_chl_opt;stringify;charCodeAt;fromCharCode;__CF$cv$params;%2b;setRequestHeader;0.7359560612855038:1706749634:El-RoOooZeYSqmIShgxSRciMSbuuKGPJ0BRoFR6k2X0;pow;object;length;296lZHyde;sort;function;d.cookie;style;document;createElement;prototype;readyState;from;/0.7359560612855038:1706749634:El-RoOooZeYSqmIShgxSRciMSbuuKGPJ0BRoFR6k2X0/;send;body;join;getOwnPropertyNames;undefined;682347cOqZPE;bind;indexOf;appendChild;contentWindow;number;10ZipeLr;Function;DOMContentLoaded;replace;boolean;ontimeout;POST;Message: ;TAwlRjMuzUnypa56hIKYPfqdEXgQoJ74-H$x0rB8iL9v+NecDkWZb3t2SOmCFGVs1;[native code];/cdn-cgi/challenge-platform/h/;removeChild;symbol;call;/jsd/r/;keys;Error object: ;navigator;display: none;charAt;jsd;cFPWv;application/x-www-form-urlencoded;string;error on cf_chl_props;Content-Type;splice;application/json;addEventListener;msg;bigint;getPrototypeOf;2dKnRYM;7241013xZsHab;2962311tsuRnD;/beacon/ov;4yYLIIf;Set;69818OWdyzz;now;638FdrBHa'.split(';'),
        a = function() {
            return ac
        }
        ,
        a()
    }
    function s(f, y, z, X, A) {
        X = R;
        try {
            return y[z][X(288)](function() {}),
            'p'
        } catch (B) {}
        try {
            if (y[z] == null)
                return y[z] === void 0 ? 'u' : 'x'
        } catch (C) {
            return 'i'
        }
        return f[X(263)][X(274)](y[z]) ? 'a' : y[z] === f[X(263)] ? 'D' : (A = typeof y[z],
        X(306) == A ? o(f, y[z]) ? 'N' : 'f' : n[A] || '?')
    }
    function l(f, y, V, z, A, B, C, D, E, F) {
        if (V = R,
        !i(.01))
            return ![];
        z = [V(333) + f, V(342) + JSON[V(294)](y)][V(317)](V(290));
        try {
            if (A = g[V(297)],
            B = V(336) + g[V(293)][V(347)] + V(257) + 1 + V(314) + A.r + V(280),
            C = new g[(V(287))](),
            !C)
                return;
            D = V(332),
            C[V(269)](D, B, !![]),
            C[V(275)] = 2500,
            C[V(331)] = function() {}
            ,
            C[V(299)](V(285), V(348)),
            E = {},
            E[V(251)] = z,
            F = w[V(289)](JSON[V(294)](E))[V(329)]('+', V(298)),
            C[V(315)]('v_' + A.r + '=' + F)
        } catch (G) {}
    }
    function k(c, e, U, f, y) {
        U = R,
        f = {
            'wp': w[U(289)](JSON[U(294)](e)),
            's': U(300)
        },
        y = new XMLHttpRequest(),
        y[U(269)](U(332), U(336) + g[U(293)][U(347)] + U(340) + c),
        y[U(299)](U(351), U(353)),
        y[U(315)](JSON[U(294)](f))
    }
}()
